An asynchronous decomposition approach to parallel global optimization

A Tree-Decomposition Approach to Parallel Query Optimization

In this paper we present an approach for transforming a relational join tree into a detailed execution plan with resource allocation information, for execution on a parallel machine. Our approach starts by transforming a query tree, such as might be generated by a sequential optimizer, into an operator tree which is then partitioned into a forest of linear chains of pipelined operators. We pres...

Parallel asynchronous particle swarm optimization.

The high computational cost of complex engineering optimization problems has motivated the development of parallel optimization algorithms. A recent example is the parallel particle swarm optimization (PSO) algorithm, which is valuable due to its global search capabilities. Unfortunately, because existing parallel implementations are synchronous (PSPSO), they do not make efficient use of comput...

An Asynchronous Space Decomposition

An Approach to Automatic Tuning for Parallel Householder QR Decomposition

We consider parallel computing of the Householder QR decomposition on SMP machines. This decomposition is one of the basic tools in matrix computations and is used in various problems such as the least square problem and the singular value decomposition of a rectangular matrix. Since this algorithm consists almost entirely of BLAS routines such as matrix-vector multiplications, the simplest way...

An Asynchronous Model of Global Parallel Genetic Algorithms

Genetic algorithms usually require more computation power than other heuristic approaches do. In this paper we introduce an efficient implementation of asynchronously global parallel genetic algorithm with 3-tournament elimination selection. The parallelization of the algorithm is achieved through multithreading mechanism, a very effective and easy to implement technique. With parallelization w...